Simultaneous approximation from convex sets
نویسندگان
چکیده
منابع مشابه
Interpolation and Approximation from Convex Sets
Let X be a topological vector space, Y = IR n , n 2 IN, A a continuous linear map from X to Y , C X, B a convex set dense in C, and d 2 Y a data point. We derive conditions which guarantee that the set B \ A ?1 (d) is nonempty and dense in C \ A ?1 (d). Some applications to shape preserving interpolation and approximation are described.
متن کاملBlind approximation of planar convex sets
The process of learning the shape of an unknown convex planar object through an adaptive process of simple measurements called Line probings, which reveal tangent lines to the object, is considered. A systematic probing strategy is suggested and an upper bound on the number of probings it requires for achieving an approximation with a pre-specified precision to the unknown object is derived. A ...
متن کاملAlgorithms for simultaneous sparse approximation. Part II: Convex relaxation
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals that participate. These elementary signals typically model coherent structures in the input signals, and they...
متن کاملApproximation and the Topology of Rationally Convex Sets
Considering a mapping g holomorphic on a neighbourhood of a rational convex set K ⊂ C, and range into the complex projective space CP, the main objective of this paper is to show that we can uniformly approximate g on K by rational mappings defined from C into CP. We only need to ask that the second Čech cohomology group Ȟ(K, Z) vanishes.
متن کاملStochastic Approximation on Discrete Sets Using Simultaneous Perturbation Difference Approximations
A stochastic approximation method for optimizing a class of discrete functions is considered. The procedure is a version of the Simultaneous Perturbation Stochastic Approximation (SPSA) method that has been modified to obtain a stochastic optimization method for cost functions defined on a grid of points in Euclidean p-space having integer components. We discuss the algorithm and examine its co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00097-6